A method to solve two-player zero-sum matrix games in chaotic environment

نویسندگان

چکیده

This research article proposes a method for solving the two-player zero-sum matrix games in chaotic environment. In fast growing world, real life situations are characterized by their behaviors and processes. The chaos variables defined to study such type of problems. Classical mathematics deals with numbers as static less value-added, while it dynamic evolutionary, comparatively more value-added. this article, payoff is numbers. While converted into corresponding matrix. An approach determining optimal strategy developed. last, one solved example provided explain utility, effectiveness applicability problem.Abbreviations: DM= Decision Maker; MCDM = Multiple Criteria Making; LPP Linear Programming Problem; GAMS= General Algebraic Modeling System.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A TRANSITION FROM TWO-PERSON ZERO-SUM GAMES TO COOPERATIVE GAMES WITH FUZZY PAYOFFS

In this paper, we deal with games with fuzzy payoffs. We proved that players who are playing a zero-sum game with fuzzy payoffs against Nature are able to increase their joint payoff, and hence their individual payoffs by cooperating. It is shown that, a cooperative game with the fuzzy characteristic function can be constructed via the optimal game values of the zero-sum games with fuzzy payoff...

متن کامل

Two-player Non-zero-sum Games: a Reduction

In this chapter, we focus on finite two-player non-zero-sum stochastic games. Following the notations used in earlier chapters, we let S be the state space, and A and B be the action sets of players 1 and 2 respectively. All three sets S,A and B are finite. Generic elements of S, A and B will be denoted by z, a and b. We let p(·|z, a, b) be the transition function of the game and r : S × A× B →...

متن کامل

Pure strategy equilibria in symmetric two-player zero-sum games

We show that a symmetric two-player zero-sum game has a pure strategy equilibrium if and only if it is not a generalized rock-paper-scissors matrix. Moreover, we show that every finite symmetric quasiconcave two-player zero-sum game has a pure equilibrium. Further sufficient conditions for existence are provided. We point out that the class of symmetric two-player zero-sum games coincides with ...

متن کامل

Two Player Non Zero-sum Stopping Games in Discrete Time

We prove that every two player non zero-sum stopping game in discrete time admits an -equilibrium in randomized strategies, for every > 0. We use a stochastic variation of Ramsey Theorem, which enables us to reduce the problem to that of studying properties of -equilibria in a simple class of stochastic games with finite state space.

متن کامل

Approximate Dynamic Programming for Two-Player Zero-Sum Markov Games

This paper provides an analysis of error propagation in Approximate Dynamic Programming applied to zero-sum two-player Stochastic Games. We provide a novel and unified error propagation analysis in Lp-norm of three well-known algorithms adapted to Stochastic Games (namely Approximate Value Iteration, Approximate Policy Iteration and Approximate Generalized Policy Iteratio,n). We show that we ca...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Independent Journal of Management & Production

سال: 2021

ISSN: ['2236-269X']

DOI: https://doi.org/10.14807/ijmp.v12i1.1295